Aggregation-iterative analogues and generalizations of projection-iterative methods
نویسندگان
چکیده
منابع مشابه
Iterative aggregation: disaggregation methods and ordering algorithms
The paper presents some modifications of two-level methods for computing stationary probability distribution vector of large discrete time Markov chains. The approach considered is an iterative aggregation disaggregation method. Two types of permuting the events are considered in order to improve the convergence.
متن کاملIterative Projection Methods for Structured Sparsity Regularization
In this paper we propose a general framework to characterize and solve the optimization problems underlying a large class of sparsity based regularization algorithms. More precisely, we study the minimization of learning functionals that are sums of a differentiable data term and a convex non differentiable penalty. These latter penalties have recently become popular in machine learning since t...
متن کاملWeights in block iterative methods
In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...
متن کاملSpatial Weighting and Iterative Projection Methods for EOFs
Often there is a need to consider spatial weighting in methods for finding spatial patterns in climate data. The focus of this paper is on techniques that maximize variance, such as empirical orthogonal functions (EOFs). A weighting matrix is introduced into a generalized framework for dealing with spatial weighting. One basic principal in the design of the weighting matrix is that the resultin...
متن کاملOn convergence of iterative projection methods for symmetric eigenvalue problems
We prove global convergence of particular iterative projection methods using the so-called shift-and-invert technique for solving symmetric generalized eigenvalue problems. In particular, we aim to provide a variant of the convergence theorem obtained by Crouzeix, Philippe, and Sadkane for the generalized Davidson method. Our result covers the Jacobi-Davidson and the rational Krylov methods wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Carpathian Mathematical Publications
سال: 2013
ISSN: 2313-0210,2075-9827
DOI: 10.15330/cmp.5.1.156-163